Deleting keratins to find one

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deleting keratins to find one

ered a third murine K6 gene, and simultaneously created a promising model system for studying keratin function in more detail. In an effort to study the function of K6, the authors generated a mouse line lacking both K6a and K6b, and found that plaques develop on the tongues of these mice and cause the majority to die of starvation within two weeks of birth. Surprisingly, and in contrast to a p...

متن کامل

P14: How to Find a Talent?

Talents may be artistic or technical, mental or physical, personal or social. You can be a talented introvert or a talented extrovert. Learning to look for your talents in the right places and building those talents into skills and abilities might take some work, but going about it creatively will let you explore your natural abilities and find your innate talents. You’re not going to fin...

متن کامل

Deleting Vertices to Bound Path Length

We examine the vertex deletion problem for weighted directed acyclic graphs (wdags). The objective is to delete the fewest number of vertices so that the resulting wdag has no path of length > δ. Several simplified versions of this problem are shown to be NP-hard. However, the problem is solved in linear time when the wdag is a rooted tree and in quadratic time when the wdag is a series-paralle...

متن کامل

Deleting vertices to graphs of bounded genus

We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time 2Cg·k 2 log knO(1), where k is the size of the deletion set, Cg is a constant depending on the Euler genus g of the target surface, and n is the size of the input graph. On the way to this result, we develop an algorithm solving the pr...

متن کامل

Quantum deleting and signalling

It is known that if one could clone an arbitrary quantum state then one could send signals faster than the speed of light. Here, we show that deletion of an unknown quantum state for which two copies are available would also lead to superluminal signalling. However, the (Landauer) erasure of an unknown quantum state does not allow faster-than-light communication.  2003 Published by Elsevier B.V.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Cell Biology

سال: 2001

ISSN: 1540-8140,0021-9525

DOI: 10.1083/jcb1543iti5